On Nonnegative Cosine Polynomials with Nonnegative Integral Coefficients
نویسندگان
چکیده
منابع مشابه
On Nonnegative Cosine Polynomials with Nonnegative Integral Coefficients
We show that there exist Po > 0 ar>d P\, ■■■ , Pn nonnegative integers, such that 0 < p(x) = Po + Pi cosx + • ■ • + Pn cos Nx and po -C s1/3 for .s = J2'J=oPj < improving on a result of Odlyzko who showed the existence of such a polynomial p that satisfies Po < (.slogs)1/3 . Our result implies an improvement of the best known estimate for a problem of Erdos and Szekeres. As our method is noncon...
متن کاملPolynomials with Nonnegative Coefficients
The authors verify the conjecture that a conjugate pair of zeros can be factored from a polynomial with nonnegative coefficients so that the resulting polynomial still has nonnegative coefficients. The conjecture was originally posed by A. Rigler, S. Trimble, and R. Varga arising out of their work on the Beauzamy-Enflo generalization of Jensen's inequality. The conjecture was also made independ...
متن کاملOn Nonnegative Cosi Ne Polynomials with Nonnegative, Integral Coeecients
We show that there is p 0 > 0 and p 1 ; : : :; p N non-negative integers, such that 0 p(x) = p 0 + p 1 cos x + + p N cos Nx and p 0 s 1=3 for s = P N j=0 p j , improving on a result of Odlyzko who showed the existence of such a polynomial p that satisses p 0 (s log s) 1=3. Our result implies an improvement of the best known estimate for a problem of Erdd os and Szekeres. As our method is non-co...
متن کاملGale duality bounds for roots of polynomials with nonnegative coefficients
We bound the location of roots of polynomials that have nonnegative coefficients with respect to a fixed but arbitrary basis of the vector space of polynomials of degree at most d. For this, we interpret the basis polynomials as vector fields in the real plane, and at each point in the plane analyze the combinatorics of the Gale dual vector configuration. We apply our technique to bound the loc...
متن کاملCharacteristic Polynomials of Nonnegative Integral Square Matrices and Clique Polynomials
Clique polynomials of vertex-weighted simple graphs coincide with polynomials of the form det(1 − xM), M a square matrix over N.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1994
ISSN: 0002-9939
DOI: 10.2307/2160181